Monotone Dynamic Programming: Director’s Cut

نویسندگان

  • Martin Kaae Jensen
  • Martin Jensen
چکیده

By integrating dynamic programming with the theory of order preserving dynamical systems (Hirsch (1982), Smith (1995)) this paper develops a new approach to stability analysis in dynamic economic models. The main results provide simple conditions on the primitives of a model which imply that steady states are globally stable for almost all initial conditions. If the steady state is unique or lattice methods are employed in their study; this completely resolves all stability questions. The methods’ applicability is demonstrated through examples from investment theory, growth theory, and renewable resource economics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interchangeability principle and dynamic equations in risk averse stochastic programming

In this paper we consider interchangeability of the minimization operator with monotone risk functionals. In particular we discuss the role of strict monotonicity of the risk functionals. We also discuss implications to solutions of dynamic programming equations of risk averse multistage stochastic programming problems.

متن کامل

A Deductive System for PC(ID)

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. This paper studies a deductive inference method for PC(ID), its propositional fragment. We introduce a formal proof system based on the sequent calculus (Gentzen-style deductive system) for this logic. As PC(ID) is an integration of classical propositional logic a...

متن کامل

Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems

A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions which are optimal in an appropriate sense. In graph-theoretic language, the problems can be recast in terms of maximal sign-consistent subgraphs. The theoretical...

متن کامل

On submodular value functions and complex dynamic programming

We investigate in this paper submodular value functions using complex dynamic programming. In complex dynamic programming (dp) we consider concatenations and linear combinations of standard dp operators, as well as combinations of maximizations and minimizations. These value functions have many applications and interpretations, both in stochastic control (and stochastic zero-sum games) as well ...

متن کامل

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ε in time polynomial in the problem size and in 1/ε. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) producti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003